منابع مشابه
Satisfaction-Based Query Load Balancing
We consider the query allocation problem in open and large distributed information systems. Provider sources are heterogeneous, autonomous, and have finite capacity to perform queries. A main objective in query allocation is to obtain good response time. Most of the work towards this objective has dealt with finding the most efficient providers. But little attention has been paid to satisfy the...
متن کاملOpenFlow-Based Server Load Balancing Gone Wild
Today’s data centers host online services on multiple servers, with a front-end load balancer directing each client request to a particular replica. Dedicated load balancers are expensive and quickly become a single point of failure and congestion. The OpenFlow standard enables an alternative approach where the commodity network switches divide traffic over the server replicas, based on packet-...
متن کاملHypergraph-based Dynamic Partitioning and Load Balancing
1.1 INTRODUCTION An important component of parallel scientific computing is the assignment of work to processors. This assignment problem is also known as partitioning or mapping. The goal of the assignment problem is to find a task-to-processor mapping that will minimize the total execution time. Although efficient optimal solutions for certain restricted variations, such as chain-or tree-stru...
متن کاملAnt-Based Load Balancing in Telecommunications Networks
La reconstruction du nid et les coordinations inter-individuelles chez Bellicosi-termes natalensis et Cubitermes sp. La theorie de la stigmergie: Essai d'interpretation des termites constructeurs. Laying and sensing odor markings as a strategy for assisting mobile robot navigation tasks.
متن کاملLoad Balancing 2-Phased Geometrically Based Problems
A k-weighted graph is a directed graph where each vertex has k associated weights. Partitioning such a graph so that each weight is roughly evenly divided into each piece is useful for balancing a parallel task with k distinct components. Such a goal arises in crash simulation, in which there there are 2 components. We present a 2-weighted graph partitioning algorithm, based on the Ham Sandwich...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2009
ISSN: 0362-1340,1558-1160
DOI: 10.1145/1594835.1504187